EBR schemes with curvilinear reconstructions for solving two-dimensional external flow problems
نویسندگان
چکیده
منابع مشابه
An Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملAn Algorithm for Two Dimensional Cutting Stock Problems with Demand
In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...
متن کاملTwo-dimensional central-upwind schemes for curvilinear grids and application to gas dynamics with angular momentum
Article history: Received 30 April 2008 Received in revised form 17 February 2009 Accepted 27 July 2009 Available online 30 July 2009 MSC: 65M70 76M12 76U05
متن کاملConstructing Two-Dimensional Multi-Wavelet for Solving Two-Dimensional Fredholm Integral Equations
In this paper, a two-dimensional multi-wavelet is constructed in terms of Chebyshev polynomials. The constructed multi-wavelet is an orthonormal basis for space. By discretizing two-dimensional Fredholm integral equation reduce to a algebraic system. The obtained system is solved by the Galerkin method in the subspace of by using two-dimensional multi-wavelet bases. Because the bases of subs...
متن کاملAn approximation algorithm for solving unconstrained two-dimensional knapsack problems
An efficient heuristic for solving two-dimensional knapsack problems is proposed. The algorithm selects an optimal subset of optimal generated strips by solving a sequence of one-dimensional knapsack problems. We show that the number of these knapsacks can be reduced to only four knapsacks. The algorithm gives an excellent worst-case experimental approximation ratio (0.98), and a high percentag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Keldysh Institute Preprints
سال: 2019
ISSN: 2071-2898,2071-2901
DOI: 10.20948/prepr-2019-152